Level-Based Analysis of the Univariate Marginal Distribution Algorithm
نویسندگان
چکیده
منابع مشابه
Cluster Head Optimization Strategy for Wireless Sensor Network Based on Univariate Marginal Distribution Algorithm
Low-energy adaptive clustering hierarchy (LEACH) protocol is studied. A cluster head optimization strategy for wireless sensor network (WSN) is proposed by using univariate marginal distribution algorithm (UMDA). The novel routing protocol is named UMDA_LEACH. It considers the overall situation in the effect of all cluster head nodes with the help of probabilistic model. By so doing, it improve...
متن کاملBinary and Gray Encoding in Univariate Marginal Distribution Algorithm, Genetic Algorithm, and Stochastic Hillclimbing
This paper employs a Markov model to study the relative performance of binary and Gray coding in the univariate marginal distribution algorithm, genetic algorithm, and stochastic hillclimbing. The results indicate that while there is little difference between the two for all possible functions, Gray coding does not necessarily improve performance for functions which have fewer local optima in t...
متن کاملSegmentation of Coronary Angiograms Using Gabor Filters and Boltzmann Univariate Marginal Distribution Algorithm
This paper presents a novel method for improving the training step of the single-scale Gabor filters by using the Boltzmann univariate marginal distribution algorithm (BUMDA) in X-ray angiograms. Since the single-scale Gabor filters (SSG) are governed by three parameters, the optimal selection of the SSG parameters is highly desirable in order to maximize the detection performance of coronary a...
متن کاملa comparative analysis of the marginal microleakages of two pit and fissure sealans, conseal-f and conseal clear
چکیده ندارد.
15 صفحه اولUnivariate Marginal Distribution Algorithm in Combination with Extremal Optimization (EO, GEO)
The UMDA algorithm is a type of Estimation of Distribution Algorithms. This algorithm has better performance compared to others such as genetic algorithm in terms of speed, memory consumption and accuracy of solutions. It can explore unknown parts of search space well. It uses a probability vector and individuals of the population are created through the sampling. Furthermore, EO algorithm is s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2018
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-0507-5